Systems and methods that transform constructs from domain to domain

ABSTRACT

The present invention provides systems and methods that isomorphically maps constructs between domain spaces (e.g., object, markup, relational and user interface domains). The systems and methods employ a mapping component that utilizes at least one suppress label(s), introduce label(s) and/or mediating schema to facilitate construct mapping. Examples of such mapping include transforming a named construct to an anonymous construct, a named construct to a named construct, an anonymous construct to a named construct, and an anonymous construct to an anonymous construct. In general, introduce labels can be utilized to provide names for anonymous constructs and/or modify existing names; suppress labels typically are utilized to suppress names such as introduced names or names a user desires to be suppressed; and mediating schema can be utilized to provide a default or user customized mapping to an intermediate schema before, during and/or after construct mapping.

TECHNICAL FIELD

The present invention generally relates to data processing, and moreparticularly to systems and methods that employ suppress labels,introduce labels and/or mediating schema to map a construct from onedomain to another domain.

BACKGROUND OF THE INVENTION

Applications commonly are built using object-oriented programminglanguages, wherein information is often modeled as domain objects. Suchobjects can be utilized to encapsulate information (e.g., businessrelated), wherein various components can manipulate these objects duringthe process of implementing use cases. In many instances, it isdesirable to build such applications such that the information isexpressed in the form of markup language, such as XML (Extensible MarkupLanguage) or SGML (Standard Generalized Markup Language) artifact, forexample.

Today, there are a variety of technologies that generate XML artifactsfrom object code or instances of object code and process the XMLartifacts. For example, standard APIs (Application Program Interfaces)such as SAX (Simple API for XML) and DOM (Document Object Model) areoften employed. In addition, industry language standards such as XSL(Extensible Style Language) and XPath are commonly utilized.Furthermore, emerging technologies such as schema compilers and databinders, and homegrown XML programming APIs (which are often built ontop of SAX and DOM) that simplify specific application needs arebecoming more and more prevalent.

However, there often is a large impedance mismatch between the structureutilized to represent XML artifacts and objects. Thus, to enableprogrammers in the object world to work seamlessly in the XML world asif the XML representation were objects, this impedance mismatch must beresolved. One common technique utilized to bridge the gap is to employ adata-binding or mapping tool. Such tools typically provide some form ofmapping between the XML and the object domains, or space. For example,given an XSD (XML Schema Definition) schema, a data binder can beutilized to serialize schema values to a type-declaration (e.g., classtype) with corresponding field labels. In another example, a data bindercan be utilized to generate the XSD schema from the type-declaration.This impedance mismatch is not limited to structural differences betweenXML and object domain representations. For example, this mismatch can befound between structures in relational, object, markup and/or userinterface domains.

Because of the structure mismatch, suitable data-binding tools mustprovide users with at least some control over construct mappings. Forexample, the user may desire to utilize different field names fordisparate domains, serialize particular fields to one or more attributesinstead of child elements, prevent particular elements from beingserialized, etc. Techniques to achieve such customization includeannotating types and/or annotating schemas.

One particular difference between a markup language representation andan object-oriented representation that amplifies the structure mismatchis the fact that type-systems of mainstream object-oriented languagesgenerally are nominal (named) types whereas many markup languageconstructs are anonymous constructs. Mapping between such differentstructures is not handled very well with conventional data-bindingtools. For example, many conventional systems when generating objectsfrom markup language interpret constraints for anonymous elements in themarkup language representation as if the constraints were distributedover named child elements in the markup language representation.However, this interpretation can result in a completely differentcontent model than what is intended by the original schema.Consequently, it might be impossible to ascertain whether the originalschema was the anonymous schema with constraints for anonymous elementsor whether the constraints were associated with the child elements.Thus, there is a need to provide more versatile data binding techniquesthat overcome the aforementioned shortcomings associated withconventional data binding systems.

SUMMARY OF THE INVENTION

The following presents a simplified summary of the invention in order toprovide a basic understanding of some aspects of the invention. Thissummary is not an extensive overview of the invention. It is notintended to identify key/critical elements of the invention or todelineate the scope of the invention. Its sole purpose is to presentsome concepts of the invention in a simplified form as a prelude to themore detailed description that is presented later.

The present invention relates to systems and methods that transformconstructs. For example, the systems and methods can be utilized totransform a construct from one domain or space to a construct in anotherdomain or space. For example, a construct in the object domain (e.g., anobject oriented based artifact) can be mapped to a construct in themarkup domain (e.g., a markup language based artifact) or vice versa. Inanother example, these constructs (object and/or markup) can betransformed to and/or from constructs in the user interface (UI) domainand/or relational domain. Moreover, such transformation can include oneor more of the following mappings: transforming a named construct to ananonymous construct; transforming a named construct to a namedconstruct; transforming an anonymous construct to a named construct; andtransforming an anonymous construct to an anonymous construct.

The present invention employs at least one of a set(s) of suppresslabels, a set(s) of introduce labels and a mediating schema(s) tofacilitate construct transformations. In general, introduced fieldlabels typically are utilized to provide names when mapping anonymousconstructs to named constructs; however, they can additionally beutilized to modify existing names. Suppressed field labels typically areutilized to suppress names when mapping named constructs to anonymousconstructs. For example, suppressed field labels can be employed to hideintroduced names or names a user desires to be absent after atransformation. Mediating schema provide a technique to utilize adefault or user customized mapping to an intermediate representation(e.g., schema) prior to transforming a construct to a desired domainrepresentation. The foregoing can overcome the mismatch when bindingnamed and/or anonymous constructs to named and/or anonymous constructs.Conventional data binding systems typically do not include a mechanismto explicitly control hide/introduce member names to bridge this domainrelated mismatch.

In one aspect of the present invention, a system that provides a mappingbetween constructs is illustrated. The system comprises a mappingcomponent that transforms one construct to another construct. Suchtransformation can be a single transformation, wherein the resultantconstruct is output, or a plurality of transformations, wherein one ormore intermediate and/or resultant constructs are output. Where morethan one construct is output, such constructs can be similar (e.g.,multiple object constructs) and/or different (e.g., at least one objectconstruct and at least one schema construct). In addition, more than oneuser and/or application can concurrently utilize (e.g., via APIs) thesystem to transform constructs. The mapping components can introduceand/or suppress construct structure (e.g., before, during and/or aftertransformation) to facilitate transformation between various constructrepresentations, wherein introduced and/or suppressed structure can beidentified as such and removed and/or made visible in order to preservethe construct's original structure (e.g., isomorphic or losslesstransformations). Examples of constructs that can be transformed inaccordance with an aspect of the present invention include object,object instance, UI, and schema constructs.

In another aspect of the present invention, a configuration component isemployed in connection with the mapping component. The configurationcomponent can store mappings between constructs. Such mapping caninclude a set(s) of introduce field labels that can be utilized torender implicit information explicit; a set(s) of suppress field labelsthat can be utilized to hide information; and a mapping file(s) (e.g.,default, user defined and intelligence based) that defines mappingsbetween constructs. The mapping component can receive anonymous or namedconstructs, retrieve a suitable mapping(s) from the configurationcomponent, and transform the received construct. Such mappings can be atleast one of the following: from a named construct to a different namedconstruct; from a named construct to an anonymous construct (e.g.,similar and different); from an anonymous construct to a differentanonymous construct; and from an anonymous construct to a namedconstruct (e.g., similar and different). Suitable constructs can berepresented in a markup language (e.g., XML and CLR), an object orientedlanguage (e.g., Java, C++, C#, Visual Basic . . . ), a relationaltable(s), and/or a user interface, for example.

In other aspects of the invention, systems that transform constructs(e.g., anonymous and named) between markup space and object space areillustrated. In one instance, the system comprises a serializer thatmaps markup space constructs to object space constructs and adeserializer that maps object space constructs to markup spaceconstructs. In another instance, the system comprises a persister thatmaps object space constructs to relational space constructs and arestorer that maps relational space constructs to object spaceconstructs. In yet another instance, the system comprises a publisherthat maps markup space constructs to relational space constructs and ashredder that maps relational space constructs to markup spaceconstructs. In still another instance, the system comprises a binderthat maps object, markup and/or relational space construct to userinterfaces and user interfaces to object, markup and/or relational spaceconstructs. Suitable mappings for the foregoing can be obtained from aconfiguration component and/or a mediating schema. The mediating schemacan be employed to generate an intermediate structure(s) thatfacilitates construct transformations.

In still other aspects of the present invention, methodologies areprovided that transform constructs. Such methodologies includetechniques that serialize, deserialize, persists, restore, publish,shred and/or bind constructs.

To the accomplishment of the foregoing and related ends, the inventioncomprises the features hereinafter fully described and particularlypointed out in the claims. The following description and the annexeddrawings set forth in detail certain illustrative aspects andimplementations of the invention. These are indicative, however, of buta few of the various ways in which the principles of the invention maybe employed. Other objects, advantages and novel features of theinvention will become apparent from the following detailed descriptionof the invention when considered in conjunction with the drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates an exemplary system that maps a construct to adifferent construct.

FIG. 2 illustrates an exemplary system that transforms anonymous and/ornamed constructs to anonymous and/or named constructs.

FIG. 3 illustrates an exemplary system that employs introduce and/orsuppress field labels to transform constructs between markup space andobject space.

FIG. 4 illustrates an exemplary system that employs mediating schema totransform constructs between markup space and object space.

FIG. 5 illustrates an exemplary system that transforms constructsbetween markup/object and user interface domains.

FIG. 6 illustrates an exemplary methodology that transforms constructsvia introduce and suppress field labels and mediating schema.

FIG. 7 illustrates an exemplary methodology that deserializes objectconstructs to XML constructs.

FIG. 8 illustrates an exemplary methodology that serializes XMLconstructs to object constructs.

FIG. 9 illustrates an exemplary methodology that generates data bindinginstructions for transforming constructs.

FIG. 10 illustrates an exemplary operating environment, wherein thenovel aspects of the present invention can be employed.

FIG. 11 illustrates an exemplary networking environment, wherein thenovel aspects of the present invention can be employed.

DETAILED DESCRIPTION OF THE INVENTION

The present invention provides systems and methods that transformconstructs between domains. In particular, a mapping component isprovided that can obtain one or more suppress labels, introduce labelsand/or mediating schema, and utilize such labels and/or schema totransform a construct from one domain to another domain. In general,introduce field labels typically are utilized to provide names foranonymous constructs and/or modify existing names, suppress field labelstypically are utilized to suppress names such as introduced names ornames a user desires to be absent, and mediating schema provide defaultand/or user defined customized mapping to generate an intermediateschema prior to transforming a construct. The foregoing can provide forimprovements over conventional systems by overcoming structuralmismatches between named and anonymous constructs and renderingisomorphic transformations.

The present invention is now described with reference to the drawings,wherein like reference numerals are used to refer to like elementsthroughout. In the following description, for purposes of explanation,numerous specific details are set forth in order to provide a thoroughunderstanding of the present invention. It may be evident, however, thatthe present invention may be practiced without these specific details.In other instances, well-known structures and devices are shown in blockdiagram form in order to facilitate describing the present invention.

As used in this application, the term “component” is intended to referto a computer-related entity, either hardware, a combination of hardwareand software, software, or software in execution. For example, acomponent can be, but is not limited to, a process running on aprocessor, a processor, an object, an executable, a thread of execution,a program, and/or a computer. By way of illustration, both anapplication running on a server and the server can be a computercomponent. In addition, one or more components can reside within aprocess and/or thread of execution, and a component can be localized onone computer and/or distributed between two or more computers.Furthermore, a component can be an entity (e.g., within a process) thatan operating system kernel schedules for execution. Moreover, acomponent can be associated with a context (e.g., the contents withinsystem registers), which can be volatile and/or non-volatile dataassociated with the execution of the thread.

FIG. 1 illustrates a system 100 that maps constructs. The system 100comprises a mapping component 110 the transforms one construct toanother construct. The system 100 further comprises an input component120 that receives constructs and conveys received constructs to themapping component 110 and an output component 130 that receives andoutputs transformed constructs.

The mapping component 110 can transform essentially any construct (e.g.,structured data) from one structure to at least one different structure.When transforming the construct to more than one other construct, theconstruct can be concurrently transformed into disparate constructs andoutput via the output component 130. For example, an object constructcan be received by the input component 120 and conveyed to the mappingcomponent 110, wherein the object construct can be mapped to a schemaconstruct, a relational construct and/or a user interface (UI)construct, disparate schema constructs, disparate relational constructs,disparate UI constructs, and/or other constructs. Generated constructscan be conveyed to the output component 130. It is to be appreciatedthat the foregoing transformation example does not limit the invention.For example, object, object instance, UI, relational tables, schema,etc. constructs can be transformed to and from one another, includingdisparate forms of the same construct (e.g., from one object constructto another object construct).

In many instances, an iterative approach can be employed, wherein aresultant construct can be cycled through the mapping component 110multiple times until the desired construct is generated. By way ofexample, a first construct can be conveyed to the mapping component 110by the input component 120, wherein the mapping component 110 transformsthe first construct to a second construct. The second construct can becycled back to the mapping component 110 and transformed to a thirdconstruct. The cycle can continue until a desired construct isgenerated, wherein any intermediate construct as well as the desiredconstruct can be serially and/or concurrently output by the outputcomponent 130.

The mapping component 110 can introduce and/or suppress entities withina construct's structure to facilitate construct transformation. Forexample, a first construct can include indicia that is not utilized in asecond construct. In these instances, the indicia can be suppressedand/or modified by the mapping component 110 before, during and/or aftertransforming to the second construct. In addition, such information,although suppressed in the second construct, can be hidden, but retainedsuch that if the second construct is transformed back to the firstconstruct, the original information can be preserved or if the secondconstruct is transformed to a third construct, the original informationcan be suitably utilized (e.g., hidden, modified and visible).

In another example, the first construct may not include indicia requiredin the second construct. In these instances, such indicia can beintroduced by the mapping component 110 before, during and/or aftertransforming the construct. Similar to suppressed indicia, introducedindicia can be identified from original structure. Thus, introducedindicia can be removed in order to preserve the original informationand/or modified to comply with another construct. The foregoing providesfor isomorphic (1:1 or lossless mapping) transformations, which canprovide for improvements over conventional systems that commonly employlossy techniques, wherein the original construct cannot be recoveredback to its original form.

The input component 120 and the output component 130 provide suitableinterfaces to interact with the mapping component 110. For example, theinput component 120 and the output component 130 can be applicationprogram interfaces (API's), software drivers, communication protocols,routines, network interfaces, and/or bus interfaces. In addition, theinput component 120 and output component 130 can be concurrentlyinterfaced to disparate entities, wherein transformation of multipleconstructs from multiple entities can be performed in parallel.

FIG. 2 illustrates a system 200 that transforms constructs. The system200 comprises a mapping component 210 that can receive an anonymous or anamed construct and map the received construct to a different anonymousor a named construct. For example, the mapping can be at least one ofthe following: from a named construct to a different named construct;from a named construct to an anonymous construct (e.g., similar anddifferent); from an anonymous construct to a different anonymousconstruct; and from an anonymous construct to a named construct (e.g.,similar and different). It is to be appreciated that such constructs(e.g., anonymous and named) can be represented in a markup language(e.g., XML and CLR), an object oriented language (e.g., Java, C++, C#,Visual Basic . . . ), a relational table(s) (e.g., SQL), and/or a userinterface, for example, and that the original and transformed constructcan be any combination of the foregoing construct examples, includingdisparate constructs. Thus, examples of construct mapping that can beemployed in accordance with various aspects of the present inventioninclude: serializing markup to objects; deserializing objects to markup;persisting objects to relational tables; restoring objects fromrelational tables; publishing markup in relational tables; shreddingrelational tables to markup; and/or binding objects, markup and/orrelational tables with user interfaces.

The configuration component 220 can store mappings between constructs.Such mapping can include a set(s) of introduce field labels that can beutilized to render implicit information explicit. For example, anintroduce field label can be utilized when mapping an anonymousconstruct to a named construct, wherein the introduce field labelprovides a name for one or more anonymous elements of the construct.Likewise, an introduce field label can be employed to provide a name forone or more elements of the anonymous construct when converting from ananonymous construct to a different anonymous construct. In addition,introduce field labels can be utilized with named constructs, forexample, to override or modify a name, including changing a namedelement to an anonymous element (e.g., a null label).

The mapping can further include a set(s) of suppress field labels.Suppress field labels can be utilized suppress field labels. Forexample, when a construct is generated, an introduce field label, asdescribed above, can be utilized to add, modify and/or remove a fieldlabel from the original construct. The set(s) of suppress field labelscan be utilized to suppress the addition, modification and/or removalsuch that the construct can be returned to its original structure, ifdesired. In addition, a construct may include field labels that do notmap to a desired construct. The suppress field labels can further beutilized to hide field labels so that the field labels are transparentin the transformed construct. Suppressed field labels can be unhiddenwhen transforming the construct back to the original construct, toanother construct, and/or if the field labels become mappable to theconstruct.

The mapping can further include a mapping file(s) (e.g., mapping schema)that defines the mapping from construct to construct. Such mappingfile(s) can comprise a default mapping, a user defined mapping, and/or amapping based on a heuristic, an inference, machine learning and/or aprobability. The mapping file(s) can be pre-determined and/ordynamically generated and/or updated. For example, a history can bemaintained and utilized to update inferences and probabilities andrefine machine learning by employing the history as training data.Mappings within the mapping file(s) can include suppress and/orintroduce field labels that can be utilized similar to that suppress andintroduce field sets described above. Moreover, the mapping file(s) caninclude a mediating schema that facilitates transforming constructs. Themediating schema can render named constructs anonymous and/or make namesexplicit to anonymous constructs before, during and/or aftertransforming constructs. In addition, the mediating schema can beutilized to generate intermediate constructs that facilitate desiredconstruct transformations.

The mapping component 210 can obtain and employ a suitable mapping fromthe configuration component 220. By way of example, when a construct isprovided to the mapping component 210, a mapping from the configurationcomponent 220 can be retrieved or generated and utilized to facilitatemapping the construct to one or more other constructs. The mapping canbe retrieved based at least in part on the desired construct and,optionally, on intelligence. For example, the user can specify a desiredconstruct, or the mapping component 210 can determine a desiredconstruct, for example, based on the user, application, and/or previousconstruct transformation.

FIG. 3 illustrates a system 300 that transforms constructs betweenmarkup space and object space. The system 300 comprises a mappingcomponent 310, a serializer 320 and a deserializer 330. The serializer320 typically is utilized to transform a markup space construct (e.g.,anonymous and named) to an object space construct (e.g., anonymous andnamed) and the deserializer 330 typically is utilized to transform anobject space construct (e.g., anonymous and named) to a markup spaceconstruct (e.g., anonymous and named). The following paragraphs provideexemplary transformation examples between markup and object space.

In one aspect of the present invention, the system 300 can be utilizedto transform a named construct in markup space 340 (e.g., a markuplanguage based construct) to a named construct in object space 350(e.g., an object oriented language based construct). By way of example,the following exemplary named XSD schema: <element name=”Point”>  <complexType>     <sequence>       <element name=”x” type=”int”/>      <element name=”y” type=”int”/>      </sequence>   </complexType></element>

can be received by the mapping component 310. The mapping component 310can convey the XSD schema to the serializer 320. In order to transformthis XSD schema to an object in object space 350, the serializer 320 canobtain a suitable mapping from the configuration component 360. Suchmapping can include suppress field labels, introduce field labels and/ormapping files, as described in detail above. Once a suitable mapping isacquired, the serializer can utilize the mapping to transform the XSDconstruct to a corresponding type declaration (e.g., class) in objectspace 350. For example, the above XSD schema can be transformed tofollowing named construct: class Point {   public int x;   public int y;}in object space 350.

It is to be appreciated that such mapping can be 1:1, wherein the labelsassociated with the first construct are utilized in the transformedconstruct, as illustrated in the above example, or customized toselectively add, modify and/or remove construct structure. For example,as an alternative, the user can specify a desire to modify a name duringthe transformation from the markup domain to the object domain. Forexample, the user may desire to serialize “Point” in the markupconstruct illustrated above to “pair” in the object construct such thatthe above example renders the following construct: class pair {   publicint x;   public int y; }wherein the class name is “pair” rather than “Point.” The mapping canalternatively be configured such that identified fields are serializedas attributes rather than child elements, for example, and/or particularfields are not serialized. It is to be understood that the foregoingexamples are provided for explanatory purposes and do not limit theinvention. In addition, any known technique to provide suchcustomization can be utilized in accordance with the present inventionand does not limit the invention.

In another aspect of the present invention, the system 300 can beutilized to transform an anonymous construct in markup space 340 (e.g.,XML and CLR) to a named construct in object space 350 (e.g., a Java,C++, C#, Visual Basic and the like construct). In general, this scenarioillustrates a large impedance mismatch between constructs in markupspace 340 and constructs in object space 350. Basically, type-systems ofmainstream object-oriented languages generally are named (nominal) typeswhereas markup language based constructs commonly are anonymousconstructs. Thus, when transforming a construct from markup space 340 toobject space 350, names typically need to be introduced to mitigateissues related to representing anonymous elements in a domain thatrequires names.

Similar to above, the serializer 320 can be utilized to transformconstructs from markup space 340 to object space 350. By way of example,the following exemplary anonymous markup based construct: <elementname=”A”>   <complexType>     <sequence maxOccurs=”unbounded”>      <element name=”B” type=”int”/>       <element name=”C”type=”int”/>      </sequence>   </complexType> </element>where an anonymous “sequence” field is associated with an “unbounded”occurrence constraint can be received by the mapping component 310.

With conventional systems, this exemplary markup language can be handledin a manner similar to markup language representations where theoccurrence constraint is distributed over the child elements of thesequence field. However, these two models describe completely differentcontent models so introducing a new type can lead to an erroneous type.The present invention mitigates the foregoing by introducing a fieldlabel for the anonymous “sequence” field in order to generate a suitableobject space construct. It is to be appreciated that this possiblebecause the present invention provides for introducing a label whendeserializing data and suppressing a label when serializing data, asdescribed in detail below. For example, the field “temporary_field_name”can be obtained from the configuration component 360 and introduced torender the following transformation to class “A”: class A {   public BC[] temporary_field_name; }

from the above schema, and the following new class “BC”: class BC {  public int B;   public int C; }associated with class “A” can be generated.

In yet another aspect of the present invention, the system 300 can beutilized to transform a named construct in object space 350 to a namedconstruct in markup space 340. By way of example, the followingexemplary named class “Point”: class Point {   public int x;   publicint y; }

can be received by the mapping component 310, wherein the mappingcomponent 310 can convey the class to the deserializer 330, which canobtain a suitable mapping from the configuration component 360 andemploy the mapping to render the following named XSD schema: <elementname=”Point”>   <complexType>     <sequence>       <element name=”x”type=”int”/>       <element name=”y” type=”int”/>      </sequence>  </complexType> </element>in markup space 340, wherein field labels are accordingly transformed.

In still another aspect of the present invention, the system 300 can beutilized to transform an anonymous construct in object space 350 (e.g.,with introduced names) to an anonymous construct in markup space 340.The mapping can be utilized in connection with a name(s) in the objectspace construct that will be suppressed in a markup spacerepresentation. By way of example, the following anonymous constructwith introduced names: class A {   public BC[ ] temporary_field_name; }

can be received by the mapping component 310, wherein the mappingcomponent 310 can convey the class to the deserializer 330, which canobtain a suitable mapping from the configuration component 360 andemploy the mapping to render the following named XSD schema: <elementname=”A”>   <complexType>     <sequence maxOccurs=”unbounded”>      <element name=”B” type=”int”/>       <element name=”C”type=”int”/>      </sequence>   </complexType> </element>in markup space 340, wherein the introduce field label“temporary_field_name” is suppressed.

Similar to serialization, deserialization can be isomorphic (as depictedin the above example) or customized to selectively introduce, modifyand/or suppress construct structure. For example, the user can specify adesire to modify a name during the transformation from the object domainto the markup domain. By way of example, the user may desire toserialize “Point” in the object construct: class Point {   public int x;  public int y; }

to “pair” in the markup construct such that the above renders thefollowing markup construct: <element name=”pair”>  <complexType>  <sequence>     <element name=”x” type=”int”/>     <element name=”y”type=”int”/>    </sequence>  </complexType> </element>with “pair” as the element name.

It is to be appreciated that the above examples are provided forbrevity, clarity and explanatory purposes, and do not limit theinvention. Thus, although the schema presented in the foregoing exampleswere depicted as “complex” types, “simple” types can additionally betransformed in accordance with aspect of the invention. In addition,other variously structured markup and object constructs can be utilizedin accordance with aspects of the present invention. In addition, it isto be appreciated that the serializer 320 and deserializer 330 can beutilized as or replaced with a persister (not shown) and restorer (notshown) in order to persist objects to relational tables and restoreobjects from relational tables and/or a publisher (not shown) andshredder (not shown) in order to publish markup in relational tablesand/or shred markup from relational tables.

FIG. 4 illustrates a system 400 that employs a mediating schema totransform constructs. The system 400 comprises a mapping component 410that includes a serializer/deserializer 420 and a schema bank 430. Theserializer/deserializer 420 can operate substantially similar to theserializer 320 and deserializer 330. The schema bank 430 can be utilizedto store mediating schema that can be employed to generate anintermediate structure when serializing and/or deserializing constructs.For example, the serializer/deserializer 420 can obtain a mediatingschema from the schema bank 430 and employ the mediating schema to mapthe following schema: <element name=”A”>  <complexType>   <sequencemaxOccurs=”unbounded”>     <element name=”B” type=”int”/>     <elementname=”C” type=”int”/>    </sequence>  </complexType> </element>

from a markup space 440 to the following intermediate structure:<element name=”A”>  <complexType>   <sequence>    <elementname=”_invisible”       type=”BC”       maxOccurs=”unbounded”>  </sequence>  </complexType> </element>

and map the intermediate structure to the following class: class A {  public BC[ ] temporary_field_name; }in an object space 450, which corresponds to the original markup schema.

In addition, the mediating schema (e.g., the same or a differentmediating schema) can be utilized to generate the following intermediatestructure schema: <complexType=”BC”>  <sequence maxOccurs=”unbounded”>  <element name=”B” type=”int”/>   <element name=”C” type=”int”/> </sequence> </complexType>

associated with the above intermediate structure and transform thisstructure into the following new class: class BC {   public int B;  public int C; }in object space 450. It is to be appreciated that the mediating schemacan also be utilized to generate the above intermediate schema from theclasses and transform the intermediate schema to the markup spacerepresentations.

FIG. 5 illustrates a system 500 that transforms constructs betweenmarkup/object space and user interface space. The system 500 comprises amapping component 510, a data binder 520 and a configuration component530. The data binder 520 can utilize mapping stored in the configurationcomponent 530 to map. For example, when transforming from markup orobject space to user interface space (e.g., an abstract logical tableconstruct), the mapping can define what elements are transformed tocorresponding columns of a table and what elements are transformed tocorresponding rows of the table. When transforming from user interfacespace to markup or object space, the mapping can define what table cellsare transformed to corresponding elements.

By way of example, the following markup schema: <sequencemaxOccurence=”unbounded”>   <element name=”SS #”/>   <elementname=”Name”/> </sequence>

can be provided to the mapping component 510 and conveyed to the databinder 520, and transformed to the following table:

in UI space by the data binder 520 via a suitable mapping from theconfiguration component 530. In addition, the system 500 can be utilizedto transform the above table to a markup or object construct by the databinder 520 via a suitable mapping from the configuration component 530.

FIGS. 6-8 illustrate methodologies in accordance with the presentinvention. For simplicity of explanation, the methodologies are depictedand described as a series of acts. It is to be understood andappreciated that the present invention is not limited by the actsillustrated and/or by the order of acts, for example acts can occur invarious orders and/or concurrently, and with other acts not presentedand described herein. Furthermore, not all illustrated acts may berequired to implement the methodologies in accordance with the presentinvention. In addition, those skilled in the art will understand andappreciate that the methodologies could alternatively be represented asa series of interrelated states via a state diagram or events.

Proceeding to FIG. 6, a methodology 600 that transforms constructs isillustrated. At reference numeral 610, a construct is received. Theconstruct can be a markup language based construct, an object orientatedlanguage based construct or a user interface based construct, forexample. In addition, the construct can include all named elements, acombination of named and anonymous elements, all anonymous elements, orat least introduced element name. Such structure can be provided by auser (e.g., via an API) and/or application in order to transform thestructure to a particular construct.

At reference numeral 620, the construct can be identified. Suchidentification can be provided by the user or application, orintelligence can be utilized to determine characteristics, attributesand/or type of construct. In addition, the identification and/or otherrelated information can be utilized to determine a desiredrepresentation. Once identified, a suitable mapping can be obtained.Such mapping can include one or more sets of suppress field labels, oneor more sets of introduce field labels, and/or mediating schema.

At 630, the mapping can be utilized to transform the construct from onedomain to another domain. In addition, transformation can includemapping a named to another named construct, a named construct to ananonymous construct, an anonymous construct to another anonymousconstruct, and/or an anonymous construct to a named construct. Atreference numeral 640, the transformed construct can be output forsubsequent utilization.

Next at FIG. 7, a methodology 700 that deserializes constructs isillustrated. At reference numeral 710, an object construct is received.The object construct can be associated with essentially any objectoriented language such as C++, C#, Visual Basic, Java and the like. Anassociated mapping indicating one or more fields to suppress or amediating schema that defines one or more fields to suppress can beobtained. If desired, one or more introduce field labels and/or ameditating schema with introduce fields can be obtained to introducefields. At reference numeral 720, the object construct can bedeserialized via the mapping to render a markup language based construct(e.g., XML and CLR). For example, any introduced field names can besuppressed in the transformed construct. In another example, userspecified field names included in the mediating schema or determined viaintelligence can be suppressed in the transformed construct. Atreference numeral 730, the markup language based construct is output.

At FIG. 8, a methodology 800 that serializes constructs is illustrated.At reference numeral 810, a markup language based (e.g., XML and CLR)construct is received. An associated mapping indicating one or morefield labels to introduce or a mediating schema that defines one or morefield labels to introduce can be obtained. If desired, one or moresuppress field labels and/or a meditating schema with suppress fieldscan be obtained to supress fields. At reference numeral 820, the markuplanguage based construct can be serialized via the mapping to render anobject oriented language based construct or binded to render a userinterface based construct. For example, field labels can be introducedin an object oriented based construct, or elements can be mapped to rowsand columns of a table of a user interface based construct. In anotherexample, a customized mapping can be utilized to introduce userspecified field labels. At reference numeral 830, the transformedconstruct is output.

At FIG. 9, a data binding methodology 900 is illustrated. At referencenumeral 910, mapping information is received. For example, a user and/orapplication can provide the mapping information. In addition, thisinformation can be provided via an API. Moreover, at least a portion ofthe mapping information can be generated, for example, via intelligence.In general, such information can be associated with classes, schemas,mapping files, etc. At reference numeral 920, the mapping informationcan be utilized to generate data-binding information. At 930,serialization code, deserialization code, classes, and/or schemas areoutput. Such output can be utilized to facilitate transformationsbetween constructs, as described in detail herein.

In order to provide a context for the various aspects of the invention,FIGS. 10 and 11 as well as the following discussion are intended toprovide a brief, general description of a suitable computing environmentin which the various aspects of the present invention can beimplemented. While the invention has been described above in the generalcontext of computer-executable instructions of a computer program thatruns on a computer and/or computers, those skilled in the art willrecognize that the invention also can be implemented in combination withother program modules. Generally, program modules include routines,programs, components, data structures, etc. that perform particulartasks and/or implement particular abstract data types.

Moreover, those skilled in the art will appreciate that the inventivemethods may be practiced with other computer system configurations,including single-processor or multiprocessor computer systems,mini-computing devices, mainframe computers, as well as personalcomputers, hand-held computing devices, microprocessor-based orprogrammable consumer electronics, and the like. The illustrated aspectsof the invention may also be practiced in distributed computingenvironments where tasks are performed by remote processing devices thatare linked through a communications network. However, some, if not allaspects of the invention can be practiced on stand-alone computers. In adistributed computing environment, program modules may be located inboth local and remote memory storage devices.

With reference to FIG. 10, an exemplary environment 1010 forimplementing various aspects of the invention includes a computer 1012.The computer 1012 includes a processing unit 1014, a system memory 1016,and a system bus 1018. The system bus 1018 couples system componentsincluding, but not limited to, the system memory 1016 to the processingunit 1014. The processing unit 1014 can be any of various availableprocessors. Dual microprocessors and other multiprocessor architecturesalso can be employed as the processing unit 1014. The system bus 1018can be any of several types of bus structure(s) including the memory busor memory controller, a peripheral bus or external bus, and/or a localbus using any variety of available bus architectures including, but notlimited to, Industrial Standard Architecture (ISA), Micro-ChannelArchitecture (MSA), Extended ISA (EISA), Intelligent Drive Electronics(IDE), VESA Local Bus (VLB), Peripheral Component Interconnect (PCI),Universal Serial Bus (USB), Advanced Graphics Port (AGP), PersonalComputer Memory Card International Association bus (PCMCIA), and SmallComputer Systems Interface (SCSI).

The system memory 1016 includes volatile memory 1020 and nonvolatilememory 1022. The basic input/output system (BIOS), containing the basicroutines to transfer information between elements within the computer1012, such as during start-up, is stored in nonvolatile memory 1022. Byway of illustration, and not limitation, nonvolatile memory 1022 caninclude read only memory (ROM), programmable ROM (PROM), electricallyprogrammable ROM (EPROM), electrically erasable ROM (EEPROM), or flashmemory. Volatile memory 1020 includes random access memory (RAM), whichacts as external cache memory. By way of illustration and notlimitation, RAM is available in many forms such as synchronous RAM(SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rateSDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), Synchlink DRAM (SLDRAM), anddirect Rambus RAM (DRRAM).

Computer 1012 also includes removable/non-removable,volatile/non-volatile computer storage media. FIG. 10 illustrates, forexample a disk storage 1024. Disk storage 1024 includes, but is notlimited to, devices like a magnetic disk drive, floppy disk drive, tapedrive, Jaz drive, Zip drive, LS-100 drive, flash memory card, or memorystick. In addition, disk storage 1024 can include storage mediaseparately or in combination with other storage media including, but notlimited to, an optical disk drive such as a compact disk ROM device(CD-ROM), CD recordable drive (CD-R Drive), CD rewritable drive (CD-RWDrive) or a digital versatile disk ROM drive (DVD-ROM). To facilitateconnection of the disk storage devices 1024 to the system bus 1018, aremovable or non-removable interface is typically used such as interface1026.

It is to be appreciated that FIG. 10 describes software that acts as anintermediary between users and the basic computer resources described insuitable operating environment 1010. Such software includes an operatingsystem 1028. Operating system 1028, which can be stored on disk storage1024, acts to control and allocate resources of the computer system1012. System applications 1030 take advantage of the management ofresources by operating system 1028 through program modules 1032 andprogram data 1034 stored either in system memory 1016 or on disk storage1024. It is to be appreciated that the present invention can beimplemented with various operating systems or combinations of operatingsystems.

A user enters commands or information into the computer 1012 throughinput device(s) 1036. Input devices 1036 include, but are not limitedto, a pointing device such as a mouse, trackball, stylus, touch pad,keyboard, microphone, joystick, game pad, satellite dish, scanner, TVtuner card, digital camera, digital video camera, web camera, and thelike. These and other input devices connect to the processing unit 1014through the system bus 1018 via interface port(s) 1038. Interfaceport(s) 1038 include, for example, a serial port, a parallel port, agame port, and a universal serial bus (USB). Output device(s) 1040 usesome of the same type of ports as input device(s) 1036. Thus, forexample, a USB port may be used to provide input to computer 1012, andto output information from computer 1012 to an output device 1040.Output adapter 1042 is provided to illustrate that there are some outputdevices 1040 like monitors, speakers, and printers, among other outputdevices 1040, which require special adapters. The output adapters 1042include, by way of illustration and not limitation, video and soundcards that provide a means of connection between the output device 1040and the system bus 1018. It should be noted that other devices and/orsystems of devices provide both input and output capabilities such asremote computer(s) 1044.

Computer 1012 can operate in a networked environment using logicalconnections to one or more remote computers, such as remote computer(s)1044. The remote computer(s) 1044 can be a personal computer, a server,a router, a network PC, a workstation, a microprocessor based appliance,a peer device or other common network node and the like, and typicallyincludes many or all of the elements described relative to computer1012. For purposes of brevity, only a memory storage device 1046 isillustrated with remote computer(s) 1044. Remote computer(s) 1044 islogically connected to computer 1012 through a network interface 1048and then physically connected via communication connection 1050. Networkinterface 1048 encompasses communication networks such as local-areanetworks (LAN) and wide-area networks (WAN). LAN technologies includeFiber Distributed Data Interface (FDDI), Copper Distributed DataInterface (CDDI), Ethernet, Token Ring and the like. WAN technologiesinclude, but are not limited to, point-to-point links, circuit switchingnetworks like Integrated Services Digital Networks (ISDN) and variationsthereon, packet switching networks, and Digital Subscriber Lines (DSL).

Communication connection(s) 1050 refers to the hardware/softwareemployed to connect the network interface 1048 to the bus 1018. Whilecommunication connection 1050 is shown inside computer 1012, it can alsobe external to computer 1012. The hardware/software necessary forconnection to the network interface 1048 includes, for exemplarypurposes only, internal and external technologies such as, modemsincluding regular telephone grade modems, cable modems and DSL modems,ISDN adapters, and Ethernet cards.

FIG. 11 is a schematic block diagram of a sample-computing environment1100 with which the present invention can interact. The system 1100includes one or more client(s) 1110. The client(s) 1110 can be hardwareand/or software (e.g., threads, processes, computing devices). Thesystem 1100 also includes one or more server(s) 1120. The server(s) 1120can also be hardware and/or software (e.g., threads, processes,computing devices). The servers 1120 can house threads to performtransformations by employing the present invention, for example.

One possible communication between a client 1110 and a server 1120 canbe in the form of a data packet adapted to be transmitted between two ormore computer processes. The system 1100 includes a communicationframework 1140 that can be employed to facilitate communications betweenthe client(s) 1110 and the server(s) 1120. The client(s) 1110 areoperably connected to one or more client data store(s) 1150 that can beemployed to store information local to the client(s) 1110. Similarly,the server(s) 1120 are operably connected to one or more server datastore(s) 1130 that can be employed to store information local to theservers 1140.

What has been described above includes examples of the presentinvention. It is, of course, not possible to describe every conceivablecombination of components or methodologies for purposes of describingthe present invention, but one of ordinary skill in the art mayrecognize that many further combinations and permutations of the presentinvention are possible. Accordingly, the present invention is intendedto embrace all such alterations, modifications, and variations that fallwithin the spirit and scope of the appended claims.

In particular and in regard to the various functions performed by theabove described components, devices, circuits, systems and the like, theterms (including a reference to a “means”) used to describe suchcomponents are intended to correspond, unless otherwise indicated, toany component which performs the specified function of the describedcomponent (e.g., a functional equivalent), even though not structurallyequivalent to the disclosed structure, which performs the function inthe herein illustrated exemplary aspects of the invention. In thisregard, it will also be recognized that the invention includes a systemas well as a computer-readable medium having computer-executableinstructions for performing the acts and/or events of the variousmethods of the invention. In addition, while a particular feature of theinvention may have been disclosed with respect to only one of severalimplementations, such feature may be combined with one or more otherfeatures of the other implementations as may be desired and advantageousfor any given or particular application. Furthermore, to the extent thatthe terms “includes” and variants thereof are utilized in either thedetailed description or the claims, these terms are intended to beinclusive similar to the “comprising.”

1. A system that maps a first construct to a second construct,comprising: a bank that stores at least one of a set of suppress fieldlabels and a set of introduce field labels; and a mapping component thatutilizes at least one of a suppress field label and an introduce fieldlabel to facilitate mapping the first construct to the second construct.2. The system of claim 1, the first construct is a named or an anonymousconstruct and the second construct is a named or an anonymous construct,and the mapping comprises one of transforming the first named constructto the second named construct; the first named construct to the secondanonymous construct; the first anonymous construct to the second namedconstruct; and the first anonymous construct to the second anonymousconstruct.
 3. The system of claim 1, the first construct is one of amarkup language construct, an object oriented language construct, arelational construct and a user interface construct, and the secondconstruct is one of a markup language construct, an object orientedlanguage construct, a relational construct and a use interfaceconstruct.
 4. The system of claim 3, the markup language construct isone of an XML and a CLR construct, the object oriented languageconstruct is one of a C++, a C#, a Java and a Visual Basic construct,and the relational construct is a SQL construct.
 5. The system of claim1, the mapping is isomorphic.
 6. The system of claim 1, furthercomprising a mapping file that provides one or more of a defaultmapping, a user customized mapping, and a mediating schema thatfacilitates mapping the first construct to the second construct.
 7. Thesystem of claim 6, the user customized mapping defines a constructstructure to suppress and introduce labels.
 8. The system of claim 6,the user customized mapping comprises at least one of an annotating typeand an annotating schema.
 9. The system of claim 6, the default mappingis based on one or more of a heuristic, an inference, a probability andmachine learning.
 10. The system of claim 6, the mediating schematransforms constructs to an intermediate representation at least one ofbefore, during and after transforming the first construct.
 11. Thesystem of claim 1, the first construct is a complex or a simpleconstruct and the second construct is a complex or a simple construct.12. The system of claim 1, the mapping component performs at least oneof the following: serializes an instance of the first construct to thesecond construct; deserializes an instance of the first construct to thesecond construct; persists the first construct to the second construct;restores the first construct from the second construct; publishes thefirst construct in the second construct; shreds the first construct fromthe second construct; and binds the first construct to the secondconstruct.
 13. A method that transforms constructs between domains,comprising: receiving a construct; obtaining a mapping associated withthe construct; and employing the mapping to transform the construct froma first domain to a second domain.
 14. The method of claim 13, furthercomprising transforming one of a named construct to a different namedconstruct; a named construct to an anonymous construct; an anonymousconstruct to a different anonymous construct, and an anonymous constructto a named construct.
 15. The method of claim 13, the transformation islossless.
 16. The method of claim 13, the mapping comprises one or moreof a suppress field label, an introduce field label, a default mapping,a user customized mapping, and a mediating schema.
 17. The method ofclaim 13, the mapping is based on one or more of a heuristic, aninference, a probability and machine learning.
 18. A method thattransforms constructs, comprising: providing a construct to transform;retrieving a mapping that facilitates construct transformation; andutilizing the mapping to transform the construct.
 19. The method ofclaim 18, the mapping comprises at least one of a suppress field label,an introduce field label, a default mapping, a user customized mapping,and a mediating schema.
 20. The method of claim 19, the mediating schematransforms constructs to an intermediate representation at least one ofbefore, during and after transforming the construct.
 21. The method ofclaim 18, the received construct is a complex or a simple construct andthe transformed construct is a complex or a simple construct.
 22. Themethod of claim 18, the transformation comprises serializing a markupconstruct to an object construct.
 23. The method of claim 18, thetransformation comprises deserializing an object construct to a markupconstruct.
 24. The method of claim 18, the transformation comprisespersisting an object construct to a relational construct.
 25. The methodof claim 18, the transformation comprises restoring an object constructfrom a relational construct.
 26. The method of claim 18, thetransformation comprises publishing a markup construct in a relationalconstruct.
 27. The method of claim 18, the transformation comprisesshredding a relational construct to markup construct.
 28. The method ofclaim 18, the transformation comprises binding the received construct toa user interface, the received construct is one of an object construct,a markup construct, a relational construct and a disparate userinterface construct.
 29. A data packet transmitted between two or morecomputer components that facilitates transforming constructs,comprising: at least one of a set of suppress field labels, a set ofintroduce field labels and a mediating schema that is utilized totransform a first construct to a second construct.
 30. A computerreadable medium storing computer executable components to facilitatetransforming constructs, comprising: a component that receives aconstruct to transform; a component that provides a mapping thatfacilitates construct transformation; and a component that utilizes themapping to transform the construct to a different domain space.
 31. Aconstruct transformation system, comprising: means for determining amapping between constructs; and means for employing the mapping totransform a first construct to a second construct.